Uzawa Algorithms for Fully Fuzzy Linear Systems

Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied. Uzawa approach, which is a popular iterative technique for saddle point problems, is considered for solving such FFLSs. In our Uzawa approach, it is possible to compute the solution of a fuzzy system using various relaxation iterative methods such as Richardson, Jacobi, Gauss-Seidel, SOR, SSOR as well as Krylov subspace methods such as GMRES, QMR and BiCGSTAB. Krylov subspace iterative methods are known to converge for a larger class of matrices than relaxation iterative methods and they exhibit higher convergence rates. Thus, they are more widely used in practical problems. Numerical experiments are to illustrate the performance of our suggested methods.